Strategies for SAT-Based Formal Verification
نویسنده
چکیده
منابع مشابه
Eureka-2008 SAT Solver
We describe the SAT solver Eureka. Eureka is a state-of-the-art SAT solver, used in various Formal Verification flows at Intel. Eureka is based upon backtrack search DLL algorithm, enhanced by failure-driven assertion loop; nonstandard conflict analyses; restart and clause deletion strategies; CBH decision heuristic and decision stack shrinking.
متن کاملSAT solver management strategies in IC3: an experimental approach
This paper addresses the problem of handling SAT solving in IC3. SAT queries posed by IC3 significantly differ in both character and number from those posed by other SAT-based model checking algorithms. In addition, IC3 has proven to be highly sensitive to the way its SAT solving requirements are handled at the implementation level. The scenario pictured above poses serious challenges for any i...
متن کاملVisSAT: Visualization of SAT Solver Internals for Computer Aided Hardware Verification
Today, many applications for formal circuit verification exist that rely on solvers for Boolean satisfiability (SAT). Usually, these applications use the SAT solver as a black-box. However, exploiting information on the internals of the solving process can speed-up the treatment of the verification task. In this paper, we present the tool VisSAT. VisSAT provides insights into the internals of S...
متن کاملSAT- and QBF-Based Reasoning Techniques
Propositional Satisfiability (SAT) and Quantified Boolean Formulas (QBFs) are the formalisms representative respectively of the complexity classes NP and PSPACE. Many problems in computer science, including formal verification and planning ones, can be naturally encoded in SAT and/or QBFs and then solved using state-of-the-art solvers. Further, these solvers can be naturally extended to deal wi...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007